import java.util.LinkedList;
import java.util.Queue;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: Solitudefire
 * Date: 2022-05-16
 * Time: 21:19
 */
public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        TreeNode root = binaryTree.createTree();
        //binaryTree.preOrderTraversal(root);
        //binaryTree.inOrderTraversal(root);
//        binaryTree.postOrderTraversal(root);
//        List<Integer> retlist = new ArrayList<>();
//        retlist.add();
//        System.out.println(binaryTree.size1(root));
        //System.out.println(binaryTree.getLeafNodeCount(root));
        //System.out.println(binaryTree.getKLevelNodeCount(root,4));
//        System.out.println("树的高度为：");
//        System.out.println(binaryTree.getHeight(root));
//        System.out.println("查找");
//        try {
//            System.out.println(binaryTree.find(root, 'T').val);
//        } catch (NullPointerException e) {
//            e.printStackTrace();
//            System.out.println("没有这个节点！");
//        }
//        System.out.println(binaryTree.isCompleteTree(root));
        binaryTree.levelOrder(root);
    }
}
